Semantics of a Typed Algebraic Lambda-Calculus
نویسنده
چکیده
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We sketch the relation with two established vectorial lambda-calculi. Then we study the problems arising from the addition of a fixed point combinator and how to modify the equational theory to solve them. We sketch an algebraic vectorial PCF and its possible denotational interpretations.
منابع مشابه
A typed, algebraic, computational lambda-calculus
Lambda-calculi with vectorial structures have been studied in various ways, but their semantics remain mostly untouched. The main contribution of this paper is to provide a categorical framework for the semantics of such algebraic lambda-calculi. We first develop a categorical analysis of a general simply-typed lambda-calculus endowed with a structure of module. We study the problems arising fr...
متن کاملQuasi-Prime Algebraic Domains
The purpose of this paper is to introduce a new class of domains called quasi-prime algebraic domains. We show that this class is a good candidate for the purpose of denotational semantics of programming languages. This is achieved by exhibiting many constructions usually needed for denotational semantics on quasi-prime algebraic domains. In the first part we motivate the notion of quasi-primes...
متن کاملPrimitive Direcursion and Difunctorial Semantics of Typed Object Calculus
This thesis concerns two closely related lines of research: (i) We contribute to the semantics of typed object calculus by giving (a) a denotational semantics using partial maps making use of an algebraic compactness assumption on the ambient category, (b) a notion of “wrappers” by which algebraic datatypes can be represented as object types, and (c) proofs of computational soundness and adequa...
متن کاملDenotational Semantics of XML-Lambda
The article deals with the denotational semantics of a special query language called XML-Lambda, which is based on the simply typed lambda calculus. Such semantics allows experimentation with a language definition, prototyping of programs, and similar experiments.
متن کاملNominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
We investigate a class of nominal algebraic Henkin-style models for the simply typed λ calculus in which variables map to names in the denotation and λ -abstraction maps to a (non-functional) name-abstraction operation. The resulting denotations are smaller and better-behaved, in ways we make precise, than functional valuation-based models. Using these new models, we then develop a generalisati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010